G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks

نویسندگان

  • Bin Wang
  • Sandeep K. S. Gupta
چکیده

In this paper, we propose a distributed algorithm called G-REMiT for building an energy efficient multicast tree in a wireless ad hoc network (WANET). G-REMiT employs a more realistic energy consumption model for wireless communication which takes into account not only the energy losses due to radio propagation but also the energy losses in the transceiver electronics. We evaluate the performance of the protocol using two energy consumption model: long range radio and short range radio. We show that for long range radio model, G-REMiT algorithm can achieve better performance than other proposals such as MLU, MLiMST, and MIP, and the energy overhead of for executing GREMiT is negligible compared with the total energy consumption for the multicast communication. For short range radio, we find that existing energy saving scheme by adjusting node’s transmission power is not suitable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Technique for Tree-based Multicasting in Wireless Ad Hoc Networks

In this paper, we study the problem of constructing source-based energy-efficient multicast trees in Wireless Ad hoc NETwork (WANET). We propose a distributed algorithm S-REMiT which refines an existing multicast tree into a more energy-efficient multicast tree through local refinements. S-REMiT algorithm uses the forwarding cost (the power expend in forwarding multicast messages to the childre...

متن کامل

S-REMiT: a distributed algorithm for source-based energy efficient multicasting in wireless ad hoc networks

In this paper we propose a distributed algorithm called S-REMiT for building an energy-efficient multicast tree in a wireless ad hoc network (WANET). S-REMiT employs a more realistic energy consumption model for wireless communication, which takes into account the energy losses not only due to radio propagation but also the energy losses in the transceiver electronics. This enables S-REMiT to a...

متن کامل

On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks

This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multicast tree is the duration from the formation of the tree to the time when the first node fails due to battery energy exhaustion. L-REMiT assumes that the energy consumed to forward a packet is proportional to the forwar...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Intuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks

In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003